Reticulum Protocol
Part 2/3 • 6.5 KB total
──────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────
Implementations
See also: Implementations
There are several implementations of Reticulum being developed besides RNS.
A Reticulum implementaton is expected to have full interoperability and sufficient functional parity with the reference implementation. Otherwise, it is not Reticulum.cite-ref-1-2-1[2]
Note: Anything claiming to be Reticulum but not using the exact cryptographic primitives of the reference implementation is not Reticulum, and possibly an intentionally compromised or weakened clone.cite-ref-2-4-0[4]
Cryptography
Reticulum uses a simple suite of efficient, strong and well-tested cryptographic primitives that are widely available:cite-ref-2-4-1[4]
• Reticulum Identity Keys are 512-bit Curve25519 keysets
• A 256-bit Ed25519 key for signatures
• A 256-bit X25519 key for ECDH key exchanges
• HKDF for key derivation
• Encrypted tokens are based on the Fernet spec
• Ephemeral keys derived from an ECDH key exchange on Curve25519
• AES-256 in CBC mode with PKCS7 padding
• HMAC using SHA-256 for message authentication
• IVs must be generated through os.urandom() or better
• No Fernet version and timestamp metadata fields
• SHA-256
• SHA-512
See also
References
cite-note-1-22. ↑ Reference Implementation, Manual. a8d24177d946de4f1f0a0fe1af9a1338:/page/blob.mu ↗
cite-note-33. ↑ "RNS 1.0.0". GitHub.
cite-note-2-44. ↑ Cryptographic Primitives, Manual. a8d24177d946de4f1f0a0fe1af9a1338:/page/blob.mu ↗
──────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────────